//package mf.tools;
//
//import java.util.Random;
//
//import mf.trees.SLTreeGrammar;
//
//public class RandomGrammar {
//
//	private static String usageText = 
//			"RandomGrammar <number of rules>\n\n" +
//			"The number of rules can be any positive integer number." +
//			"If omitted, it will be randomly guessed as a number between 10 and 1000.\n\n" +
//			"This programm generates a random straight-line contextfree tree grammar with " +
//			"node labels k, g, f, h and a. Its rank is in this order 4, 3, 2, 1, 0.";
//	
//	public static void main(String[] args) {
//		System.out.println(usageText);
//		
//		int numberOfRules;
//		Random r = new Random();
//		
//		if(args.length != 0) {
//			numberOfRules = Integer.parseInt(args[0]);
//		} else
//			numberOfRules = r.nextInt(990)+10;
//		
//		SLTreeGrammar gr = new SLTreeGrammar();
//		
//		for(int i=0; i<numberOfRules; i++){
//			//guess if type 1 or type 2
//			
//			//if type 1, guess two nonterminals. and add both with their rank to an queue.
//			
////			gr.addRule()
//		}
//	}
//}
